منابع مشابه
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Given a graph G that admits a perfect matching, we investigate the parameter η(G) (originally motivated by computer graphics applications) which is defined as follows. Among all nonnegative edge weight assignments, η(G) is the minimum ratio between (i) the maximum weight of a perfect matching and (ii) the maximum weight of a general matching. In this paper, we determine the exact value of η for...
متن کاملEfficient algorithms for maximum weight matchings in general graphs with small edge weights
Let G = (V,E) be a graph with positive integral edge weights. Our problem is to find a matching of maximum weight in G. We present a simple iterative algorithm for this problem that uses a maximum cardinality matching algorithm as a subroutine. Using the current fastest maximum cardinality matching algorithms, we solve the maximum weight matching problem in O(W √ nm logn(n /m)) time, or in O(Wn...
متن کاملOn disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
We show that any 2−factor of a cubic graph can be extended to a maximum 3−edge-colorable subgraph. We also show that the sum of sizes of maximum 2− and 3−edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices.
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملGraphs whose edge set can be partitioned into maximum matchings
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing’s classification of simple graphs based on edge chromatic index.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.08.021